Survey on Planar Drawing of Clustered Graphs
نویسنده
چکیده
In recent years, there has been great interest in graph drawing to express relational information and applications range from CASE tools, reverse engineering, idea organization, and software design. However, as the graphs to be visualized become more and more complex, extended structured graph variations are needed. Clustered graphs are graphs with recursive clustering structures. The possible utility of clustered graphs include CASE tools, reverse engineering, idea organization, software design, knowledge representation, visualization of social networks and biological networks , VLSI design tools and divide and conquer approaches. Thus, clustered graphs are useful tools worth investigating.
منابع مشابه
Convex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملClustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [6,10–16] and clustered graphs [5,7]. In k-level graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. I...
متن کاملDrawing Planar Clustered Graphs in 2.5 Dimensions
Clustering techniques have proven to be useful in reducing the complexity of large networks. We present a method for drawing a clustered graph in 2.5D, given the clusters of the graph are connected in a planar way. The main contribution is to develop a weighted version of the well known 2D straight line drawing algorithm of de Fraysseix, Pach and Pollack [5] for planar graphs. This version allo...
متن کاملPlanar Drawing of Clustered Graphs
Graphs are often used to represent relational information. As the amount of information that we want to visualize becomes larger and more complicated, classical graph model tends to be insuucient. In this paper, we introduce and show how to draw a practical and simple graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clus...
متن کاملDrawing Clustered Graphs on an Orthogonal Grid
Clustered graphs are graphs with recursive clustering structures over the vertices. For graphical representation, the clustering structure is represented by a simple region that contains the drawing of all the vertices which belong to that cluster. In this paper, we present an algorithm which produces planar drawings of clustered graphs in a convention known as orthogonal grid rectangular clust...
متن کامل